Searching in Random Partially Ordered Sets
نویسندگان
چکیده
We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently near-optimal search strategies for typical partial orders. We consider two classical models for random partial orders, the random graph model and the uniform model. We shall show that certain simple, fast algorithms are able to produce nearly-optimal search strategies for typical partial orders under the two models of random partial orders that we consider. For instance, our algorithm for the random graph model produces, in linear time, a search strategy that makes O ( (logn) log logn ) more queries than the optimal strategy, for almost all partial orders on n elements. Since we need to make at least lgn = log2 n queries for any n-element partial order, our result tells us that one may efficiently devise near-optimal search strategies for almost all partial orders in this model (the problem of determining an optimal strategy is NP-hard, as proved recently in [1]). ? Partially supported by PICDT/CAPES. ?? Supported by a CNPq doctorate Studentship (Proc. 141633/1998-0). ? ? ? Partially supported by MCT/CNPq through ProNEx Programme (Proc. CNPq 664107/1997–4) and by CNPq (Proc. 300334/93–1 and 468516/2000–0).
منابع مشابه
Tripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملInterval fractional integrodifferential equations without singular kernel by fixed point in partially ordered sets
This work is devoted to the study of global solution for initial value problem of interval fractional integrodifferential equations involving Caputo-Fabrizio fractional derivative without singular kernel admitting only the existence of a lower solution or an upper solution. Our method is based on fixed point in partially ordered sets. In this study, we guaranty the existence of special kind of ...
متن کاملFixed point theorems for $alpha$-$psi$-contractive mappings in partially ordered sets and application to ordinary differential equations
In this paper, we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.
متن کاملCategorical properties of regular partially ordered pure monomorphisms
Let a family of monomorphisms in the category A To study mathematical notions in a category A, such as injectivity, tensor products, flatness, with respect to a class M of its (mono)morphisms, one should know some of the categorical properties of the pair (A ,M ). In this paper we take A to be thecategory Pos-S of S-partially ordered sets and to be a particular class o...
متن کاملRandom coincidence point results for weakly increasing functions in partially ordered metric spaces
The aim of this paper is to establish random coincidence point results for weakly increasing random operators in the setting of ordered metric spaces by using generalized altering distance functions. Our results present random versions and extensions of some well-known results in the current literature.
متن کامل